A Special Homotopy Continuation Method for a Class of Polynomial Systems
نویسندگان
چکیده
A special homotopy continuation method, as a combination of the polyhedral homotopy and the linear product homotopy, is proposed for computing all the isolated solutions to a special class of polynomial systems. The root number bound of this method is between the total degree bound and the mixed volume bound and can be easily computed. The new algorithm has been implemented as a program called LPH using C++. Our experiments show its efficiency compared to the polyhedral or other homotopies on such systems. As an application, the algorithm can be used to find witness points on each connected component of a real variety.
منابع مشابه
AN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملNumerical Polynomial Homotopy Continuation Method to Locate All The Power Flow Solutions
The manuscript addresses the problem of finding all solutions of power flow equations or other similar nonlinear system of algebraic equations. This problem arises naturally in a number of power systems contexts, most importantly the direct methods for transient stability analysis and voltage stability assessment. Here we introduce a novel form of homotopy continuation method called the numeric...
متن کاملCmpsc : a Continuation Method for Polynomial Systems (c++ Version)
CMPSc is a C++ program for homotopy continuation methods to find all isolated solutions of a system of polynomial equations. The numerical methods for solving polynomial systems employed in CMPSc are equivalent to the ones used in a matlab program CMPSm. The focus of CMPSc is on implementation of the cheater’s homotopy. The software CMPSc, this manual and some numerical examples are available a...
متن کاملTropical Homotopy Continuation
Inspired by numerical homotopy methods we propose a combinatorial homotopy algorithm for finding all isolated solutions to a tropical polynomial systems of n tropical polynomials in n variables. In particular, a tropicalisation of the numerical “regeneration” technique leads to a new method for enumerating the mixed cells of a mixed subdivision. This tropical approach shares some ideas with the...
متن کاملPolynomial Homotopies for Dense, Sparse and Determinantal Systems
Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution of a generic system that is used to start up the deformations. Software and applications are discussed. AMS Subject Classification. 14N10, 14M15, 52A39, 52B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017